Color Retrieval in Vector Space Model
نویسندگان
چکیده
Many applications involving similarity search use the QBIC Euclidian distance to match two color histograms. To alleviate certain problems associated with this approach, which is based on a distance metric, in this paper, we propose a Color-Color Similarity Retrieval Approach to compute the similarities between images. This approach, based on the similarity matrix between feature vectors, leads to three new color-color similarity retrieval models, called (PA, Q), (P, QA), and (PB, QB) if the color-color similarity matrix A is positive definite. By precomputing the similarity matrix and all the products PA, PB, QA and QB, where P and Q are respectively, vectors representing images from the database and B is obtained by decomposing A in a special way, the retrieval function becomes linear during the retrieval step. To compute the similarity matrix A, we propose a more general form than that of the QBIC approach. In addition, in this paper, we introduce a new algorithm, Kernel Rocchio Algorithm, which combines the simplicity of Rocchio method with the power of non-linear kernel functions to improve the relevance feedback process. In this context, we prove that the proposed retrieval models are equivalent, in the sense that the query learned via relevance feedback in one model can also be learned in any of the other models. We implement our algorithms and test them on a synthetic dataset that allows easy mechanism for specification of image relevance for a user query. For learning purpose, we also consider a model that we refer to as the (P, Q) model, which does not require the use of the matrix A. Our results show that the (P, Q) retrieval model, used together with the polynomial kernel, provides better results compared to other combinations of retrieval models and kernel functions. We believe that if the method of computing color correlations is improved, the similarity retrieval model ((PA, Q), (P, QA), or (PB, QB)) should perform, quality-wise, just as well as the (P, Q) model, as shown by our theoretical results.
منابع مشابه
Color Image Retrieval Based on Full Range Autoregressive Model with Low-level Features
This paper proposes a novel method, based on Full Range Autoregressive (FRAR) model with Bayesian approach for color image retrieval. The color image is segmented into various regions according to its structure and nature. The segmented image is modeled to RGB color space. On each region, the model parameters are computed. The model parameters are formed as a feature vector of the image. The Ho...
متن کاملSVM Based Classification Technique for Color Image Retrieval
Due to digitization of technology there is a large volume digital images available. In recent years, CBIR is a research field which includes quickly search field of images from large database. Among all the types available of CBIR technology, color based image retrieval is growing area of interest. The technique mentioned in this paper is to develop Support Vector Machine based classification s...
متن کاملMulti Resolution Enhanced Orthogonal Polynomilas Based Autocorrelogram for Color Image Retrieval
This paper proposes a simple color image retrieval method based on multi resolution enhanced orthogonal polynomials model. In the proposed method, a set of orthogonal polynomials has been chosen and the model coefficients are reordered into multiresolution subband like structure. The subband coefficients are quantized into three levels. Then the weighted autocorrelogram is computed from the qua...
متن کاملA Histogramm with Perceptually Smooth Color Transition for Image Retrieval
We propose a novel histogram generation technique using the HSV color space. The histogram retains a perceptually smooth color transition that enables us to do a window-based comparison of feature vectors for the purpose of effective retrieval of similar images from very large databases. During retrieval, we use a vector cosine distance measure for the ordering of image feature vectors. This di...
متن کاملAssorted Color Spaces to improve the Image Retrieval using VQ Codebooks Generated using LBG and KEVR
The paper presents performance comparison of image retrieval methods based on texture feature extraction using Vector Quantization (VQ) codebook generation techniques like LBG and KEVR (Kekre‟s Error Vector Rotation) with assorted color spaces. The image is divided into non overlapping blocks of size 2x2 pixels (each pixel with red, green and blue component). Each block corresponds to one train...
متن کاملColor texture moments for content-based image retrieval
In this paper, we adopt local Fourier transform as a texture representation scheme and derive eight characteristic maps for describing different aspects of co-occurrence relations of image pixels in each channel of the (SVcosH, SVsinH, V) color space. Then we calculate the first and second moments of these maps as a representation of the natural color image pixel distribution, resulting in a 48...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003